Local Search Algorithms for Partial MAXSAT
نویسندگان
چکیده
MAXSAT solutions, i.e., near-satisfying assignments for propositional formulas, are sometimes meaningless for real-world problems because such formulas include “mandatory clauses” that must be all satisfied for the solution to be reasonable. In this paper, we introduce Partial MAXSAT and investigate how to solve it using local search algorithms. An instance of Partial MAXSAT consists of two formulas fA and f~, and its solution must satisfy all clauses in fA and as many clauses in fB as possible. The basic idea of our algorithm is to give weight to fA-clauses (the mandatory clauses) and then apply local search. We face two problems; (i) what amount of weight is appropriate and (ii) how to deal with the common action of local search algorithms, giving weight to clauses for their own purpose, which will hide the initial weight as the algorithms proceed.
منابع مشابه
Tailoring Local Search for Partial MaxSAT
Partial MaxSAT (PMS) is a generalization to SAT and MaxSAT. Many real world problems can be encoded into PMS in a more natural and compact way than SAT and MaxSAT. In this paper, we propose new ideas for local search for PMS, which mainly rely on the distinction between hard and soft clauses. We use these ideas to develop a local search PMS algorithm called Dist. Experimental results on PMS ben...
متن کاملFrom Decimation to Local Search and Back: A New Approach to MaxSAT
Maximum Satisfiability (MaxSAT) is an important NP-hard combinatorial optimization problem with many applications andMaxSAT solving has attracted much interest. This work proposes a new incomplete approach toMaxSAT.We propose a novel decimation algorithm for MaxSAT, and then combine it with a local search algorithm. Our approach works by interleaving between the decimation algorithm and the loc...
متن کاملGreedy or Not? Best Improving versus First Improving Stochastic Local Search for MAXSAT
Stochastic local search (SLS) is the dominant paradigm for incomplete SAT and MAXSAT solvers. Early studies on small 3SAT instances found that the use of “best improving” moves did not improve search compared to using an arbitrary “first improving” move. Yet SLS algorithms continue to use best improving moves. We revisit this issue by studying very large random and industrial MAXSAT problems. B...
متن کاملPreprocessing Fitness Functions
Genetic algorithms, Evolutionary strategies and many variants of local search algorithms are being applied directly on a fitness function. Such direct search algorithms require minimal knowledge of a problem and can be applied to a wide variety of different domains. This paper suggests to apply a simple mapping on the fitness function – which we refer to as a “preprocessing” step. Any direct se...
متن کاملOn Partitioning for Maximum Satisfiability
Partitioning formulas is motivated by the expectation to identify easy to solve subformulas, even though at the cost of having more formulas to solve. In this paper we suggest to apply partitioning to Maximum Satisfiability (MaxSAT), the optimization version of the well-known Satisfiability (SAT) problem. The use of partitions can be naturally combined with unsatisfiability-based algorithms for...
متن کامل